Reducing a Target Interval to a Few Exact Queries
نویسندگان
چکیده
Many combinatorial problems involving weights can be formulated as a so-called ranged problem. That is, their input consists of a universe U , a (succinctly-represented) set family F ⊆ 2 , a weight function ω : U → {1, . . . , N}, and integers 0 ≤ l ≤ u ≤ ∞. Then the problem is to decide whether there is an X ∈ F such that l ≤ ∑ e∈X ω(e) ≤ u. Well-known examples of such problems include Knapsack, Subset Sum, Maximum Matching, and Traveling Salesman. In this paper, we develop a generic method to transform a ranged problem into an exact problem (i.e. a ranged problem for which l = u). We show that our method has several intriguing applications in exact exponential algorithms and parameterized complexity, namely: – In exact exponential algorithms, we present new insight into whether Subset Sum and Knapsack have efficient algorithms in both time and space. In particular, we show that the time and space complexity of Subset Sum and Knapsack are equivalent up to a small polynomial factor in the input size. We also give an algorithm that solves sparse instances of Knapsack efficiently in terms of space and time. – In parameterized complexity, we present the first kernelization results on weighted variants of several well-known problems. In particular, we show that weighted variants of Vertex Cover and Dominating Set, Traveling Salesman, and Knapsack all admit polynomial randomized Turing kernels when parameterized by |U |. Curiously, our method relies on a technique more commonly found in approximation algorithms.
منابع مشابه
A new idea for exact solving of the complex interval linear systems
In this paper, the aim is to find a complex interval vector [Z] such that satisfies the complex interval linear system C[Z]=[W]. For this, we present a new method by restricting the general solution set via applying some parameters. The numerical examples are given to show ability and reliability of the proposed method.
متن کاملInterval MULTIMOORA method with target values of attributes based on interval distance and preference degree: biomaterials selection
A target-based MADM method covers beneficial and non-beneficial attributes besides target values for some attributes. Such techniques are considered as the comprehensive forms of MADM approaches. Target-based MADM methods can also be used in traditional decision-making problems in which beneficial and non-beneficial attributes only exist. In many practical selection problems, some attributes ha...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملEnrichment and Reductionism: Two Approaches for Web Query Classification
Classifying web queries into predefined target categories, also known as web query classification, is important to improve search relevance and online advertising. Web queries are however typically short, ambiguous and in constant flux. Moreover, target categories often lack standard taxonomies and precise semantic descriptions. These challenges make the web query classification task a non-triv...
متن کاملExternal Plagiarism Detection based on Human Behaviors in Producing Paraphrases of Sentences in English and Persian Languages
With the advent of the internet and easy access to digital libraries, plagiarism has become a major issue. Applying search engines is one of the plagiarism detection techniques that converts plagiarism patterns to search queries. Generating suitable queries is the heart of this technique and existing methods suffer from lack of producing accurate queries, Precision and Speed of retrieved result...
متن کامل